Constituency and Dependency Relationship from a Tree Adjoining Grammar and Abstract Categorial Grammars Perspective
نویسندگان
چکیده
This paper gives an Abstract Categorial Grammar (ACG) account of (Kallmeyer and Kuhlmann, 2012)’s process of transformation of the derivation trees of Tree Adjoining Grammar (TAG) into dependency trees. We make explicit how the requirement of keeping a direct interpretation of dependency trees into strings results into lexical ambiguity. Since the ACG framework has already been used to provide a logical semantics from TAG derivation trees, we have a unified picture where derivation trees and dependency trees are related but independent equivalent ways to account for the same surface–meaning relation.
منابع مشابه
Stochastic Categorial Grammars
Statistical methods have turned out to be quite successful in natural language processing. During the recent years, several models of stochastic grammars have been proposed, including models based on lexicalised context-free grammars [3], tree adjoining grammars [15], or dependency grammars [2, 5]. In this exploratory paper, we propose a new model of stochastic grammar, whose originality derive...
متن کاملImplications of Binding for Lexicalized Grammars
Vijay-Shanker and Weir 1990 have shown that the most basic form of Tree-adjoining grammars (TAG) and Combinatory Categorial Grammars (CCG) are weakly equivalent. Nevertheless, actual grammars and analyses for fragments of natural languages in the two frameworks appear very diierent. In particular , in order to capture coordination, unbounded dependency, and intonation structure, CCG and a numbe...
متن کاملSeparating Dependency from Constituency in a Tree Rewriting System
We de ne a new grammar formalism called LinkSharing Tree Adjoining Grammar (LSTAG) which arises directly out of a concern for distinguishing the notion of constituency from the notion of relating lexical items in terms of linguistic dependency1(Mel’ĉuk, 1988; Rambow and Joshi, 1992). This work derives directly from work on Tree Adjoining Grammars (TAG) (Joshi, Levy, and Takahashi, 1975) where t...
متن کاملLambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the nonassociative Lambek calculus, the LambekGrishin calculus and the multimodal Lambek calculus, are shown to generate class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement grammars as an intermediate step. As a consequence both extensions are mildly context-sensitive formalisms and benefit from polynomial parsing algorithms.
متن کاملOne More Perspective on Semantic Relations in TAG
It has often been noted that the derivation trees of “standard” TAG grammars for natural languages (Group, 1998) resemble semantic dependency trees (Mel’ĉuk, 1988). More interesting, from a formal perspective, are the ways in which the derivation trees and the dependency trees diverge for certain problematic constructions. The desire to fix these cases has led to a variety of proposals for modi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013